A cyclic binary morphism avoiding Abelian fourth powers
نویسندگان
چکیده
منابع مشابه
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden’s theorem, they proved that if a word avoids Abelian k-powers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian k-powers occur in a word ...
متن کاملFixed points avoiding Abelian k-powers
We show that the problem of whether the fixed point of a morphism avoids Abelian k-powers is decidable under rather general conditions.
متن کاملOn shortest crucial words avoiding abelian powers
Let k ≥ 2 be an integer. An abelian k-th power is a word of the form X1X2 · · ·Xk where Xi is a permutation of X1 for 2 ≤ i ≤ k. A word W is said to be crucial with respect abelian k-th powers if W avoids abelian k-th powers, but Wx ends with an abelian k-th power for any letter x occurring in W . Evdokimov and Kitaev [2] have shown that the shortest length of a crucial word on n letters avoidi...
متن کامل-powers and the Thue-Morse morphism
In 1982, Séébold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue-Morse word and its complement. We strengthen Séébold’s result by showing that the same result holds if the term ‘overlapfree’ is replaced with ‘ 3 -power-free’. Furthermore, the number 7 3 is best possible.
متن کاملAbelian Complexity of Fixed Point of Morphism
We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0 7→ 012, 1 7→ 02, 2 7→ 1 starting with 0. This infinite ternary sequence appears a lot in the literature and finds applications in several fields such as combinatorics on words; for example, in pattern avoidance it is often used to construct infinite words avoiding given patterns. It has b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.09.027